//https://leetcode.cn/problems/reverse-string/description/
class Solution {
public:
    void reverseString(vector<char>& s) {
	for (int i = 0; i < s.size() / 2; i++)  //注意这里不取等号，因为中间那个没必要处理，偶数到不了，奇数不用换
	{
		char tmp = s[i];
		s[i] = s[s.size() - i - 1];
		s[s.size() - i - 1] = tmp;
	}

    /////////左右指针的方法开始///////////////
    int i = 0;
	int j = s.size() - 1;
	while (i < j)
	{
		int k = s[i];
		s[i] = s[j];
		s[j] = k;
		i++;
		j--;
	}
    /////////////左右指针方法结束////////////
    }
};

//方法：用左右指针
